منابع مشابه
The ubiquitous Ewens sampling formula
Ewens’s sampling formula exemplifies the harmony of mathematical theory, statistical application, and scientific discovery. The formula not only contributes to the foundations of evolutionary molecular genetics, the neutral theory of biodiversity, Bayesian nonparametrics, combinatorial stochastic processes, and inductive inference but also emerges from fundamental concepts in probability theory...
متن کاملA finitary characterization of Ewens sampling formula
The clustering of agents in the market is a typical problem dealt with by the new approaches to macroeconomic modeling, that describe macroscopic variables in terms of the behavior of a large collection of microeconomic entities. Clustering has a lot of economical interpretations [3], that are often described by Ewens Sampling Formula (ESF). This formula can be traced back to Fisher as “species...
متن کاملInvariable generation of infinite groups
Article history: Received 30 April 2014 Available online 18 September 2014 Communicated by Charles Leedham-Green
متن کاملRejoinder: The Ubiquitous Ewens Sampling Formula
The main article and extended discussion point to Ewens’s sampling formula (ESF) as one of a few essential probability distributions. Arratia, Barbour and Tavaré explain the emergence of ESF by the Feller coupling and also touch on number theoretic considerations; Feng provides deeper background on diffusion processes and nonequilibrium versions of ESF; and McCullagh regales us with a story fro...
متن کاملConvergence Time to the Ewens Sampling Formula
In this paper, we establish the cutoff phenomena for the discrete time infinite alleles Moran model. If M is the population size and μ is the mutation rate, we find a cutoff time of log(Mμ)/μ generations. The stationary distribution for this process in the case of sampling without replacement is the Ewens sampling formula. We show that the bound for the total variation distance from the generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2018
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s096354831800007x